New worst-case results for the bin-packing problem

1994 ◽  
Vol 41 (4) ◽  
pp. 579-585 ◽  
Author(s):  
David Simchi-Levi
Keyword(s):  
Bin Packing ◽  
Packing Problem ◽  
Worst Case ◽  
Bin Packing Problem

Worst-case analyses, linear programming and the bin-packing problem

1998 ◽  
Vol 83 (1-3) ◽  
pp. 213-227 ◽  
Author(s):  
Lap Mui Ann Chan ◽  
David Simchi-Levi ◽  
Julien Bramel
Keyword(s):  
Linear Programming ◽  
Bin Packing ◽  
Packing Problem ◽  
Worst Case ◽  
Bin Packing Problem

scholarly journals On a generalized problem of bin packing

2015 ◽  
Vol 1 (2) ◽  
pp. 14-21
Author(s):  
Nguyen Trong
Keyword(s):  
Bin Packing ◽  
Heuristic Algorithms ◽  
Case Analysis ◽  
Packing Problem ◽  
Worst Case Analysis ◽  
Worst Case ◽  
Np Completeness ◽  
Bin Packing Problem

A generalization of the bin packing problem, called the DTMR problem is studied. The NP-completeness of  DTMR is proved. Three heuristic algorithms-the CNN, the CHT and the CSX are described and the worst-case analysis of them are given. Some applications of the DTMR are shown.

Sign in / Sign up

Export Citation Format

Share Document